Unbounded probabilistic sophistication

نویسنده

  • Igor Kopylov
چکیده

I extend Machina and Schmeidler’s (1992) model of probabilistic sophistication to unbounded uncertain prospects (acts) and derive risk preferences over the induced probability distributions (lotteries) with unbounded support. For example, risk preferences can be derived over normal, exponential, and Poisson families of probability distributions. My extension uses a version of Arrow’s (1970) Monotone Continuity, which implies countable additivity for subjective beliefs and a novel property of tail-continuity for the revealed risk preferences. On the other hand, I do not assume P6 (Small Event Continuity) that is used both by Savage (1954) and Machina–Schmeidler. © 2010 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Completeness in Probabilistic Metric Spaces

The idea of probabilistic metric space was introduced by Menger and he showed that probabilistic metric spaces are generalizations of metric spaces. Thus, in this paper, we prove some of the important features and theorems and conclusions that are found in metric spaces. At the beginning of this paper, the distance distribution functions are proposed. These functions are essential in defining p...

متن کامل

Unbounded-2-bounded: a two-phase approximation for model checking unbounded until properties of probabilistic systems

Jennings, Paul, "Unbounded-2-bounded: a two-phase approximation for model checking unbounded until properties of probabilistic systems" (2011). Graduate Theses and Dissertations. Paper 12134.

متن کامل

M-sophistication

The m-sophistication of a finite binary string x is introduced as a generalization of some parameter in the proof that complexity of complexity is rare. A probabilistic near sufficient statistic of x is given which length is upper bounded by the m-sophistication of x within small additive terms. This shows that m-sophistication is lower bounded by coarse sophistication and upper bounded by soph...

متن کامل

Probabilistic sophistication and stochastic monotonicity in the Savage framework

Machina and Schmeidler [Machina, M., Schmeidler, D., 1992. A more robust definition of subjective probability. Econometrica 60, 745–780] show that probabilistic sophistication can be obtained in a Savage setting without imposing expected utility by dropping Savage's axiom P2 (sure-thing principle) and strengthening his axiom P4 (weak comparative probability). Their stronger axiom, however, embo...

متن کامل

Information measures for infinite sequences

We revisit the notion of computational depth and sophistication for infinite sequences and study the density of the sets of deep and sophisticated infinite sequences. Koppel defined the sophistication of an object as the length of the shortest total program that given some data as input produces it and the sum of the size of the program with the size of the data is as consice as the smallest de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Mathematical Social Sciences

دوره 60  شماره 

صفحات  -

تاریخ انتشار 2010